A generalization of a necessary and sufficient condition for primality due to Vantieghem
نویسنده
چکیده
We present a family of congruences which hold if and only if a natural number n is prime. 2000 Mathematics Subject Classification: 11A51, 11A07. The subject of primality testing has been in the mathematical and general news recently, with the announcement [1] that there exists a polynomial-time algorithm to determine whether an integer p is prime or not. There are older deterministic primality tests which are less efficient; the classical example is Wilson’s theorem, that
منابع مشابه
On (Semi-) Edge-primality of Graphs
Let $G= (V,E)$ be a $(p,q)$-graph. A bijection $f: Eto{1,2,3,ldots,q }$ is called an edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ where $f^+(u) = sum_{uwin E} f(uw)$. Moreover, a bijection $f: Eto{1,2,3,ldots,q }$ is called a semi-edge-prime labeling if for each edge $uv$ in $E$, we have $GCD(f^+(u),f^+(v))=1$ or $f^+(u)=f^+(v)$. A graph that admits an ...
متن کاملA Formalisation of Lehmer’s Primality Criterion
In 1927, Lehmer presented criterions for primality, based on the converse of Fermat’s litte theorem [2]. This work formalizes the second criterion from Lehmer’s paper, a necessary and sufficient condition for primality. As a side product we formalize some properties of Euler’s φ-function, the notion of the order of an element of a group, and the cyclicity of the multiplicative group of a finite...
متن کاملAn Investigation of Norm of Belief’s Proper Formulation
That falsity is a defect in belief can be captured with a prohibitive norm holding that truth is the necessary condition for permissibility of belief. Furthermore, such a formulation avoids the difficulties encountered in earlier literature that offered prescriptive norms. The normativity of belief thesis is widely discussed in the literature. I criticise bi-conditional formulation of the norm ...
متن کاملA Note on the Descent Property Theorem for the Hybrid Conjugate Gradient Algorithm CCOMB Proposed by Andrei
In [1] (Hybrid Conjugate Gradient Algorithm for Unconstrained Optimization J. Optimization. Theory Appl. 141 (2009) 249 - 264), an efficient hybrid conjugate gradient algorithm, the CCOMB algorithm is proposed for solving unconstrained optimization problems. However, the proof of Theorem 2.1 in [1] is incorrect due to an erroneous inequality which used to indicate the descent property for the s...
متن کاملThe second dual of strongly zero-product preserving maps
The notion of strongly Lie zero-product preserving maps on normed algebras as a generalization of Lie zero-product preserving maps are dened. We give a necessary and sufficient condition from which a linear map between normed algebras to be strongly Lie zero-product preserving. Also some hereditary properties of strongly Lie zero-product preserving maps are presented. Finally the second dual of...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Math. Mathematical Sciences
دوره 2004 شماره
صفحات -
تاریخ انتشار 2004